Order of Gauss periods in large characteristic ∗ †

نویسنده

  • Mei-Chu Chang
چکیده

Let p be the characteristic of Fq and let q be a primitive root modulo a prime r = 2n + 1. Let β ∈ Fq2n be a primitive rth root of unity. We prove that the multiplicative order of the Gauss period β + β−1 is at least (log p)c logn for some c > 0. This improves the bound obtained by Ahmadi, Shparlinski and Voloch when p is very large compared with n. We also obtain bounds for ”most” p.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gauss periods as constructions of low complexity normal bases

Optimal normal bases are special cases of the so-called Gauss periods (Disquisitiones Arithmeticae, Articles 343-366); in particular, optimal normal bases are Gauss periods of type (n,1) for any characteristic and type (n,2) for characteristic 2. We present the multiplication tables and complexities of Gauss periods of type (n, t) for all n and t = 3,4,5 over any finite field and give a slightl...

متن کامل

Orders of Gauss

It is shown that Gauss periods of special type give an explicit polynomial-time computation of elements of exponentially large mul-tiplicative order in some nite elds. This can be considered as a step towards solving the celebrated problem of nding primitive roots in nite elds in polynomial time.

متن کامل

Multiplicative Order of Gauss Periods

We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases over finite fields. This bound improves the previous bound of J. von zur Gathen and I. E. Shparlinski.

متن کامل

Gauss periods: orders and cryptographical applications

Experimental results on the multiplicative orders of Gauss periods in finite fields are presented. These results indicate that Gauss periods have high order and are often primitive (self-dual) normal elements in finite fields. It is shown that Gauss periods can be exponentiated in quadratic time. An application is an efficient pseudorandom bit generator.

متن کامل

Pure Gauss Sums over Finite Fields

New classes of pairs e,p are presented for which the Gauss sums corresponding to characters of order e over finite fields of characteristic p are pure, i.e., have a real power. Certain pure Gauss sums are explicitly evaluated. §

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012